Verification of Switch-Level Designs with Many-Valued Logic
نویسندگان
چکیده
Thispaperis anapproachto
منابع مشابه
Extracting Inheritance Hierarchies from Prolog Programs: A System Based on the Inference of Type Relations
Consistency Checking of Automata Functional Specifications p. 76 Yet Another Application for Toupie: Verification of Mutual Exclusion Algorithms p. 86 Parsing with DCG-Terms p. 98 A First Order Resolution Calculus with Symmetries p. 110 Ordered Paramodulation and Resolution as Decision Procedure p. 122 Static Analysis of Prolog with Cut p. 134 A New Type Theory for Representing Logics p. 146 Ve...
متن کاملFormal verification of memory circuits by switch-level simulation
A logic simulator can prove the correctness of a digital circuit if it can be shown that only circuits implementing the system specification will produce a particular response to a sequence of simulation commands. Three-valued modeling, where the third state indicates a signal with unknown digital value, can greatly reduce the number of patterns that need to be simulated for complete verificati...
متن کاملEdge-Shifted Decision Diagrams for Multiple-Valued Logic
Symbolic data structures for multi-valued logics are useful in a number of applications, from model-checking to circuit design and switch-level circuit verification. Such data structures are referred to as decision diagrams, and are typically considered effective if they are small, i.e., common co-factors of a function are shared, and canonical, i.e., given a variable ordering, there is a uniqu...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملDesign Error Diagnosis Based on Verification Techniques
Error diagnosis is becoming more difficult in VLSI circuit designs due to the increasing complexity. In this paper, we present an algorithm based on verification for improving the accuracy of design error diagnosis. This algorithm integrates three-valued logic simulation and Boolean satisfiability(SAT). It uses test patterns generated by gate level stuck-at fault ATPG tool for parallel pattern ...
متن کامل